Shellable Cactus Graphs
نویسندگان
چکیده
منابع مشابه
Broadcasting on cactus graphs
Broadcasting is the process of dissemination of a message from one vertex (called originator) to all other vertices in the graph. This task is accomplished by placing a sequence of calls between neighboring vertices, where one call requires one unit of time and each call involves exactly two vertices. Each vertex can participate in one call per one unit of time. Determination of the broadcast t...
متن کاملShellable graphs and sequentially Cohen-Macaulay bipartite graphs
Associated to a simple undirected graph G is a simplicial complex ∆G whose faces correspond to the independent sets of G. We call a graph G shellable if ∆G is a shellable simplicial complex in the non-pure sense of Björner-Wachs. We are then interested in determining what families of graphs have the property that G is shellable. We show that all chordal graphs are shellable. Furthermore, we cla...
متن کاملSome Algorithms on Cactus Graphs
A cactus graph is a connected graph in which every block is either an edge or a cycle. In this paper we give a brief idea how to design some optimal algorithms on cactus graphs in O(n) time, where n is the total number of vertices of the graph. The cactus graph has many applications in real life problems, specially in radio communication system.
متن کاملCentdian Computation in Cactus Graphs
This paper focuses on the centdian problem in a cactus network where a cactus network is a connected undirected graph, and any two simple cycles in the graph have at most one node in common. The cactus network has important applications for wireless sensor networks when a tree topology might not be applicable and for extensions to the ring architecture. The centdian criterion represents a conve...
متن کاملCactus Graphs and Some Algorithms
A cactus graph is a connected graph in which every block is either an edge or a cycle. In this paper, we consider several problems of graph theory and developed optimal algorithms to solve such problems on cactus graphs. The running time of these algorithms is O(n), where n is the total number of vertices of the graph. The cactus graph has many applications in real life problems, especially in ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: MATHEMATICA SCANDINAVICA
سال: 2010
ISSN: 1903-1807,0025-5521
DOI: 10.7146/math.scand.a-15130